منابع مشابه
Bayesian estimation of genomic distance.
We present a Bayesian approach to the problem of inferring the number of inversions and translocations separating two species. The main reason for developing this method is that it will allow us to test hypotheses about the underlying mechanisms, such as the distribution of inversion track lengths or rate constancy among lineages. Here, we apply these methods to comparative maps of eggplant and...
متن کاملPAC-Bayesian Bounds for Sparse Regression Estimation with Exponential Weights
We consider the sparse regression model where the number of parameters p is larger than the sample size n. The difficulty when considering high-dimensional problems is to propose estimators achieving a good compromise between statistical and computational performances. The BIC estimator for instance performs well from the statistical point of view [11] but can only be computed for values of p o...
متن کاملGeneral classes of performance lower bounds for parameter estimation: part II: Bayesian bounds
In this paper, a new class of Bayesian lower bounds is proposed. Derivation of the proposed class is performed via projection of each entry of the vector-function to be estimated on a closed Hilbert subspace of L2. This Hilbert subspace contains linear transformations of elements in the domain of an integral transform, applied on functions used for computation of bounds in the Weiss-Weinstein c...
متن کاملEstimation with Bayesian Inference
A probabilistic technique for the joint estimation of background and sources in high-energy astrophysics is described. Bayesian inference is applied to gain insight into the coexistence of background and sources through a probabilistic two-component mixture model, which provides consistent uncertainties of background and sources. The present analysis is applied on ROSAT PSPC data in Survey Mode...
متن کاملAccelerated k-means with adaptive distance bounds
We propose an acceleration that computes the same answer as the standard kmeans algorithm in substantially less time. Like Hamerly’s [3] and Elkan’s [2] accelerated algorithms, we avoid unnecessary distance calculations using distance bounds. For each point, Hamerly keeps one lower bound and Elkan keeps k, but we keep b lower bounds, where 1 < b < k. Our algorithm adaptively selects and adjusts...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2012
ISSN: 1070-9908,1558-2361
DOI: 10.1109/lsp.2012.2224865